Inductive learning from preclassified training examples: an empirical study

نویسندگان

  • Weiqi Li
  • Milam Aiken
چکیده

Many real-world decision-making problems fall into the general category of classification. Algorithms for constructing knowledge by inductive inference from example have been widely used for some decades. Although these learning algorithms frequently address the same problem of learning from preclassified examples and much previous work in inductive learning has focused on the algorithms’ predictive accuracy, little attention has been paid to the effect of data factors on the performance of a learning system. An experiment was conducted using five learning algorithms on two data sets to investigate how the change in labeling the class attribute can alter the behavior of learning algorithms. The results show that different preclassification rules applied on the training examples can affect either the classification accuracy or classification structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Study of the Noise Impact on Cost-Sensitive Learning

In this paper, we perform an empirical study of the impact of noise on cost-sensitive (CS) learning, through observations on how a CS learner reacts to the mislabeled training examples in terms of misclassification cost and classification accuracy. Our empirical results and theoretical analysis indicate that mislabeled training examples can raise serious concerns for cost-sensitive classificati...

متن کامل

Inductive Learning with BCT

BCT (Binary Classification Tree) is a system that learns from examples and represents learned concepts as a binary polythetic decision tree. Polythetic trees differ from monothetic decision trees in that a logical combination of multiple (versus a single) attribute values may label each tree arc. Statistical evaluations are used to recursively partition the concept space in two and expand the t...

متن کامل

Limitations on Inductive Learning

This paper explores the proposition that inductive learning from examples is fundamentally limited to learning only a small fraction of the total space of possible hypotheses. We begin by deening the notion of an algorithm reliably learning a good approximation to a concept C. An empirical study of three algorithms (the classical algorithm for maximally speciic conjunctive generalizations, ID3,...

متن کامل

Knowledge acquisition from complex domains by combining inductive learning and theory revision

In the process of knowledge acquisition, inductive learning and theory revision play important roles. Inductive learning is used to acquire new knowledge (theories) from training examples; and theory revision improves an initial theory with training examples. A theory preference criterion is critical in the processes of inductive learning and theory revision. A new system called knowar is devel...

متن کامل

The Coevolution of Antibodies for Concept Learning

We present a novel approach to concept learning in which a coevolutionary genetic algorithm is applied to the construction of an immune system whose antibodies can discriminate between examples and counter-examples of a given concept. This approach is more general than traditional symbolic approaches to concept learning and can be applied in situations where preclassified training examples are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Systems, Man, and Cybernetics, Part C

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1998